An Algorithm for Inversion in GF(2) Suitable for Implementation Using a Polynomial Multiply Instruction on GF(2)
نویسندگان
چکیده
An algorithm for inversion in GF(2) suitable for implementation using a polynomial multiply instruction on GF(2) is proposed. It is based on the extended Euclid’s algorithm. In the algorithm, operations corresponding to several contiguous iterations of the VLSI algorithm proposed by Brunner et al. is represented as a matrix. They are calculated at once through the matrix efficiently by means of a polynomial multiply instruction on GF(2). For example, in the case where the word size of a processor and m are 32 and 571, respectively, the algorithm calculates inversion with about the half number of instructions of the conventional algorithm on the average.
منابع مشابه
Impact of Intel's New Instruction Sets on Software Implementation of GF(2)[x] Multiplication
PCLMULQDQ, a new instruction that supports GF(2)[x] multiplication, was introduced by Intel in 2010. This instruction brings dramatic change to software implementation of multiplication in GF(2m) fields. In this paper, we present improved Karatsuba formulae for multiplying two small binary polynomials, compare different strategies for PCLMULQDQbased multiplication in the five GF(2m) fields reco...
متن کاملEfficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields
This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The par...
متن کاملGF(2) bit-parallel squarer using generalised polynomial basis for new class of irreducible pentanomials
Introduction: The squarer is an important circuit building block in square-and-multiply-based exponentiation and inversion circuits. When GF(2) elements are represented in a normal basis, squaring is simply a circular shift operation. Therefore, most previous works on squarers focused on other representations of GF(2) elements. For practical applications where values of n are often in the range...
متن کاملLow-Power Design of a Functional Unit for Arithmetic in Finite Fields GF(p) and GF(2m)
Recent multi-application smart cards are equipped with powerful 32-bit RISC cores clocked at 33 MHz or even more. They are able to support a variety of public-key cryptosystems, including elliptic curve systems over prime fields GF(p) and binary fields GF(2) of arbitrary order. This flexibility is achieved by implementing the cryptographic primitives in software and taking advantage of dedicate...
متن کاملGF(2n) Bit-Parallel Squarer Using Generalized Polynomial Basis For a New Class of Irreducible Pentanomials
Introduction: Squarer is an important circuit building block in squareand-multiply-based exponentiation and inversion circuits. When GF (2n) elements are represented in a normal basis, squaring is simply a circular shift operation. Therefore, most previous works on squarers focused on other representations of GF (2n) elements. For practical applications where values of n are often in the range ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007